Improved bounds for ( kn ) ! and the factorial polynomial
نویسنده
چکیده
In this article, improved bounds for (kn)! and the factorial polynomial are obtained using Kober’s inequality and Lagrange’s identity.
منابع مشابه
Improved Parameterized Upper Bounds for Vertex Cover
This paper presents an O(1.2738 + kn)-time polynomialspace parameterized algorithm for Vertex Cover improving the previous O(1.286+kn)-time polynomial-space upper bound by Chen, Kanj, and Jia. The algorithm also improves the O(1.2745k+kn)-time exponentialspace upper bound for the problem by Chandran and Grandoni.
متن کاملSimplicity is Beauty: Improved Upper Bounds for Vertex Cover
This paper presents an O(1.2738 + kn)-time polynomial-space algorithm for VERTEX COVER improving both the previous O(1.286 +kn)-time polynomial-space algorithm by Chen, Kanj, and Jia, and the very recent O(1.2745k + kn)time exponential-space algorithm, by Chandran and Grandoni. Most of the previous algorithms rely on exhaustive case-bycase analysis, and an underlying conservative worst-case-sce...
متن کاملImproved Bounds for the Number of (<=k)-Sets, Convex Quadrilaterals, and the Rectilinear Crossing Number of Kn
We use circular sequences to give an improved lower bound on the minimum number of (≤ k)-sets in a set of points in general position. We then use this to show that if S is a set of n points in general position, then the number (S) of convex quadrilaterals determined by the points in S is at least 0.37553 ( n 4 ) +O(n). This in turn implies that the rectilinear crossing number cr(Kn) of the comp...
متن کاملUpper Bounds for Vertex Cover Further Improved
The problem instance of Vertex Cover consists of an undirected graph G = (V, E) and a positive integer k, the question is whether there exists a subset C ⊆ V of vertices such that each edge in E has at least one of its endpoints in C with |C| ≤ k. We improve two recent worst case upper bounds for Vertex Cover. First, Balasubramanian et al. showed that Vertex Cover can be solved in time O(kn + 1...
متن کاملFaber polynomial coefficient estimates for bi-univalent functions defined by subordinations
A function is said to be bi-univalent on the open unit disk D if both the function and its inverse are univalent in D. Not much is known about the behavior of the classes of bi-univalent functions let alone about their coefficients. In this paper we use the Faber polynomial expansions to find coefficient estimates for four well-known classes of bi-univalent functions which are defined by subord...
متن کامل